Using aggregation to reduce response time variability in cyclic fair sequences
نویسندگان
چکیده
منابع مشابه
Using aggregation to reduce response time variability in cyclic fair sequences
Isr develops, applies and teaches advanced methodologies of design and analysis to solve complex, hierarchical, heterogeneous and dynamic problems of engineering technology and systems for industry and government. Isr is a permanent institute of the university of maryland, within the a. James clark school of engineering. It is a graduated national science foundation engineering research center....
متن کاملConstructing Perfect Aggregations to Eliminate Response Time Variability in Cyclic Fair Sequences
Isr develops, applies and teaches advanced methodologies of design and analysis to solve complex, hierarchical, heterogeneous and dynamic problems of engineering technology and systems for industry and government. Isr is a permanent institute of the university of maryland, within the a. James clark school of engineering. It is a graduated national science foundation engineering research center....
متن کاملRank aggregation in cyclic sequences
In this paper we propose the problem of finding the cyclic sequence which best represents a set of cyclic sequences. Given a set of elements and a precedence cost matrix we look for the cyclic sequence of the elements which is at minimum distance from all the ranks when the permutation metric distance is the Kendall Tau distance. In other words, the problem consists of finding a robust cyclic r...
متن کاملGenerating Cyclic Fair Sequences for Multiple Servers
Fair sequences allocate capacity to competing demands in a variety of manufacturing and computer systems. This paper considers the generation of cyclic fair sequences for a set of servers that must process a given set of products, each of which must be produced multiple times in each cycle. The objective is to create a sequence that minimizes, for each product, the variability of the time betwe...
متن کاملCyclic Just-In-Time Sequences Are Optimal
Consider the Product Rate Variation problem. Given n products 1, ..., i, ..., n, and n positive integer demands d1, ..., di, ..., dn. Find a sequence α = α1, ..., αT , T = ∑n i=1 di, of the products, where product i occurs exactly di times that always keeps the actual production level, equal the number of product i occurrences in the prefix α1, ..., αt, t = 1, ..., T , and the desired productio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Scheduling
سال: 2009
ISSN: 1094-6136,1099-1425
DOI: 10.1007/s10951-009-0127-7